منابع مشابه
Forest Cover Change in Siberia - Results from the Siberia-II Project
* Corresponding author. Abstract – In this paper results of an object oriented image analysis approach for forest change detection based on spectral, contextual and object specific attributes are presented. A change detection classification system is developed that derives a change map using 1989 and the status in 2000 for selected forest inventory test territories in Siberia with extensive gro...
متن کاملNOTES AND CORRESPONDENCE Relationship between Springtime Surface Temperature and Early Summer Blocking Activity over Siberia
Influence of springtime surface condition over Siberia upon subsequent summertime blocking activity over northeastern Siberia, and the Okhotsk sea is examined. It is found that when the surface temperature over Siberia is high in April (the high years), blocking events over northeastern Siberia, and the Okhotsk sea in May and June, occur more frequently than climatology. In the high years, a je...
متن کاملNotes on Dictyuchus species (Stramenopila, Oomycetes) from Anzali lagoon, Iran
Nine Dictyuchus isolates were obtained from floating and decaying twigs and leaves in Anzali lagoon, Anzali County, Guilan province, Iran. They are interestingly distinguished from current Dictyuchus species by the presence of dictyoid and achlyoid type of zoospore discharge, abundant fusiform and spherical gemma, and the absence of any sexual apparatus. In addition, phylogene...
متن کاملNotes on some Encyrtidae (Hymenoptera: Chalcidoidea) from Iran
زنبور‌های خانواده‌یEncyrtidae از عوامل موفق در کنترل آفات گیاهی و به ویژه شپشک‌های آردآلود می‌باشند. در مطالعات انجام شده در سال‌های 85-1381 که به منظور شناسایی پارازیتوییدهای شپشک‌های آردآلود در استان فارس انجام گرفت، از این خانواده و زیرخانواده‌ی Tetracneminae، گونه‌های Gyranusoidea indica Shafee, Alam & Agarwal از روی شپشک آردآلود Maconellicoccus hirsutus (Green) روی توت سفید در جهرم،Anagy...
متن کاملNotes on Complexity Theory Notes Taken From
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1876
ISSN: 0028-0836,1476-4687
DOI: 10.1038/013469b0